Parallel standard cell placement algorithms with quality equivalent to simulated annealing
نویسندگان
چکیده
منابع مشابه
Parallel standard cell placement algorithms with quality equivalent to simulated annealing
Parallel algorithms with quality equivalent to the simulated annealing placement algorithm for standard cells [23] are presented. The first, called heuristic spanning, creates parallelism by simultaneously investigating different areas of the plausible combinatorial search space. It is used to replace the high temperature portion of simulated annealing. The low temperature portion of Simulated ...
متن کاملParallel Standard Cell Place- Ment Algorithms with Quality Equivalent to Simulated Annealing. Ieee Transac- Tions On
39 { Introduce algorithms to keep errors within a constant factor of the temperature. Use x5 and x6 to help estimate the factor. { Increase the number of annealing steps performed at each temperature to compensate for errors. Use x6.3 to help estimate the number of steps. { Weigh the performance beneets of parallelism or sloppy computations against the increased annealing steps to obtain the sa...
متن کاملAn evaluation of parallel simulated annealing strategies with application to standard cell placement
Simulated annealing, a methodology for solving combinatorial optimization problems, is a very computationally expensive algorithm, and as such, numerous researchers have undertaken efforts to parallelize it. In this paper, we investigate three of these parallel simulated annealing strategies when applied to standard cell placement, specifically the TimberWolfSC placement tool. We have examined ...
متن کاملParallel Simulated Annealing Algorithms
n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...
متن کاملParallel simulated annealing strategies for VLSI cell placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been undertaken to parallelize this algorithm. Most previous parallel approaches to cell placement annealing have used a parallel moves approach. In this paper we investigate two new approaches that have been proposed for gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1988
ISSN: 0278-0070
DOI: 10.1109/43.3172